Exercise training and detraining process affects plasma adiponectin level in healthy and spontaneously hypertensive rats

BACKGROUND: Adiponectin levels with long-term swimming exercise have been never investigated in spontaneously hypertensive rats (SHR). OBJECTIVE: This study was aimed to investigate the effects of exercise and detraining process on the adiponectin plasma levels of spontaneously hypertensive rats (SHR) and healthy Wistar-Kyoto rats (WKY). MATERIAL AND METHODS: The rats in the exercise groups were swimming for 10 weeks, 5 days/week, one hour in a day. The detraining rats were left to be sedentary in their cages for 5 weeks after 10 weeks of exercise period. RESULTS: The plasma adiponectin levels decreased in E and SHRE groups compared to the SC and the SHR groups, respectively. In addition, blood pressure was decreased in the exercise groups vs their controls. The adiponectin level was not found to be significantly different in ED and SHRED groups compared to their controls. The blood pressure did not differ between SDC and ED groups, although in the SHRED group it was found to be lower than in SHRSD group rats. CONCLUSION: The results of this study showed that exercise reduced plasma levels of adiponectin in healthy and spontaneously hypertensive rats. However, this difference disappeared at the end of the training processes. Our results suggest, that changes in plasma adiponectin levels are not responsible for changes in blood pressure

Busca por similaridade em índice invertido utilizando o framework Hadoop Map-Reduce

Na área de Recuperação de Informação, é comum o uso de índices invertidos em sistemas que realizam a busca de objetos armazenados através de consultas compostas por palavras chave (termos). Nesse contexto, a busca por similaridade representa uma estratégia poderosa, uma vez que permite arecuperação de objetos que não seriam recuperados se fosse empregada a busca por equivalência. Contudo, a quantidade de objetos armazenados, a maneira como a similaridade é calculada e o número de termos da consulta podem levar a tempos de execução proibitivos se o processamento não for distribuído. Assim, esse artigo explora a possibilidade de uso do Hadoop Map-Reduce como forma de distribuir o processamento envolvido nesse tipo de busca. Além de propor um algoritmo de mapeamento, o artigo discute experimentos de busca realizados sobre um repositório digital de objetos. Os resultados mostram os cenários de teste em que o processamento distribuído se sobressai em relação ao processamento centralizado

Collaborative Broadcast in O(log log n) Rounds

We consider the multihop broadcasting problem for $n$ nodes placed uniformly at random in a disk and investigate the number of hops required to transmit a signal from the central node to all other nodes under three communication models: Unit-Disk-Graph (UDG), Signal-to-Noise-Ratio (SNR), and the wave superposition model of multiple input/multiple output (MIMO). In the MIMO model, informed nodes cooperate to produce a stronger superposed signal. We do not consider the problem of transmitting a full message nor do we consider interference. In each round, the informed senders try to deliver to other nodes the required signal strength such that the received signal can be distinguished from the noise. We assume sufficiently high node density $\rho= \Omega(\log n)$. In the unit-disk graph model, broadcasting needs $O(\sqrt{n/\rho})$ rounds. In the other models, we use an Expanding Disk Broadcasting Algorithm, where in a round only triggered nodes within a certain distance from the initiator node contribute to the broadcasting operation. This algorithm achieves a broadcast in only $O(\frac{\log n}{\log \rho})$ rounds in the SNR-model. Adapted to the MIMO model, it broadcasts within $O(\log \log n - \log \log \rho)$ rounds. All bounds are asymptotically tight and hold with high probability, i.e. $1- n^{-O(1)}$.Comment: extended abstract accepted for ALGOSENSORS 201

SYNTHESYS+ Virtual Access - Report on the Ideas Call (October to November 2019)

The SYNTHESYS consortium has been operational since 2004, and has facilitated physical access by individual researchers to European natural history collections through its Transnational Access programme (TA). For the first time, SYNTHESYS+ will be offering virtual access to collections through digitisation, with two calls for the programme, the first in 2020 and the second in 2021. The Virtual Access (VA) programme is not a direct digital parallel of Transnational Access - proposals for collections digitisation will be prioritised and carried out based on community demand, and data must be made openly available immediately. A key feature of Virtual Access is that, unlike TA, it does not select the researchers to whom access is provided. Because Virtual Access in this way is new to the community and to the collections-holding institutions, the SYNTHESYS+ consortium invited ideas through an Ideas Call, that opened on 7th October 2019 and closed on 22nd November 2019, in order to assess interest and to trial procedures. This report is intended to provide feedback to those who participated in the Ideas Call and to help all applicants to the first SYNTHESYS+Virtual Access Call that will be launched on 20th of February 2020.This is an open access article distributed under the terms of the Creative Commons Attribution License (CC BY 4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. The attached file is the published pdf

Allogeneic Hematopoietic Stem Cell Transplantation (alloHSCT) Following Blinatumomab-Induced Remission in Pediatric Patients with Relapsed/Refractory (r/r) B-Precursor Acute Lymphoblastic Leukemia (ALL): Preliminary Results from a Phase I/II Stud

n/

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547

Combined distributed turbo coding and space frequency block coding techniques

The distributed space-time (frequency) coding and distributed channel turbo coding used independently represent two cooperative techniques that can provide increased throughput and spectral efficiency at an imposed maximum Bit Error Rate (BER) and delay required from the new generation of cellular networks. This paper proposes two cooperative algorithms that employ jointly the two types of techniques, analyzes their BER and spectral efficiency performances versus the qualities of the channels involved, and presents some conclusions regarding the adaptive employment of these algorithms. © 2010 V. Bota et al.FP7/ICT/2007/21547